Resource bounds for parallel computation of threshold and symmetric functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bounds for Threshold and Symmetric Functions in Parallel Computation

We consider the family of decision problems of the threshold languages L g. A threshold language L g is the set of n bit vectors having at least g(n) \1"s. Using a new technique for controlling the size and structure of a hypergraph by a potential function, we prove lower bounds for these decision problems on a PRIORITY PRAM with m shared memory cells and any polynomial number of processors. Th...

متن کامل

Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation

The multiplication operation and the computation of symmetric functions are fundamental problems in arithmetic and algebraic computation. We describe unit-weight threshold circuits to perform the multiplication of two n-bit integers, which have fan-in k, edge complexity O(n 2+1=d), and depth O(log d + log n= log k), for any xed integer d > 0. For a given fan-in, our constructions have considera...

متن کامل

Threshold and Symmetric Functions over Bitmaps

Bitmap indexes are routinely used to speed up simple aggregate queries in databases. Set operations such as intersections, unions and complements can be represented as logical operations (and, or, not). However, less is known about the application of bitmap indexes to more advanced queries. We want to extend the applicability of bitmap indexes. As a starting point, we consider symmetric Boolean...

متن کامل

Upper and lower bounds of symmetric division deg index

Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...

متن کامل

Resource-Aware Parallel Adaptive Computation for Clusters

Smaller institutions can now maintain local cluster computing environments to support research and teaching in high-performance scientific computation. Researchers can develop, test, and run software on the local cluster and move later to larger clusters and supercomputers at an appropriate time. This presents challenges in the development of software that can be run efficiently on a range of c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1991

ISSN: 0022-0000

DOI: 10.1016/0022-0000(91)90042-4